Complexity and Algorithms for the Discrete Fréchet Distance Upper Bound with Imprecise Input
نویسندگان
چکیده
We study the problem of computing the upper bound of the discrete Fréchet distance for imprecise input, and prove that the problem is NP-hard. This solves an open problem posed in 2010 by Ahn et al. If shortcuts are allowed, we show that the upper bound of the discrete Fréchet distance with shortcuts for imprecise input can be computed in polynomial time and we present several efficient algorithms.
منابع مشابه
Computing the discrete Fréchet distance upper bound of imprecise input is NP-hard
The Fréchet distance is a natural measure of similarity between two curves [4]. The Fréchet distance between two curves is often referred to as the “dog-leash distance”. Alt and Godau [4] presented an algorithm to compute the Fréchet distance between two polygonal curves of n and m vertices in O(nm log(nm)) time. There has been a lot of applications using the Fréchet distance to do pattern/curv...
متن کاملComputing the Discrete Fréchet Distance with Imprecise Input
We consider the problem of computing the discrete Fréchet distance between two polygonal curves when their vertices are imprecise. An imprecise point is given by a region and this point could lie anywhere within this region. By modelling imprecise points as balls in arbitrary fixed dimension, we present an algorithm for this problem that returns in time O(mn log(mn)) the Fréchet distance lower ...
متن کاملHow Difficult is it to Walk the Dog?
We study the complexity of computing the Fréchet distance (also called dog-leash distance) between two polygonal curves with a total number of n vertices. For two polygonal curves in the plane we prove an Ω(n log n) lower bound for the decision problem in the algebraic computation tree model allowing arithmetic operations and tests. Up to now only a O(n) upper bound for the decision problem was...
متن کاملComputing the Fréchet Gap Distance
Measuring the similarity of two polygonal curves is a fundamental computational task. Among alternatives, the Fréchet distance is one of the most well studied similarity measures. Informally, the Fréchet distance is described as the minimum leash length required for a man on one of the curves to walk a dog on the other curve continuously from the starting to the ending points. In this paper we ...
متن کاملOn Optimal Polyline Simplification using the Hausdorff and Fr\'echet Distance
We revisit the classical polygonal line simplification problem and study it using the Hausdorff distance and Fréchet distance. Interestingly, no previous authors studied line simplification under these measures in its pure form, namely: for a given ε > 0, choose a minimum size subsequence of the vertices of the input such that the Hausdorff or Fréchet distance between the input and output polyl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1509.02576 شماره
صفحات -
تاریخ انتشار 2015